The Tau Constant of a Metrized Graph and its Behavior under Graph Operations

نویسنده

  • Zubeyir Cinkir
چکیده

This paper concerns the tau constant, which is an important invariant of a metrized graph, and which has applications to arithmetic properties of curves. We give several formulas for the tau constant, and show how it changes under graph operations including deletion of an edge, contraction of an edge, and union of graphs along one or two points. We show how the tau constant changes when edges of a graph are replaced by arbitrary graphs. We prove Baker and Rumely’s lower bound conjecture on the tau constant for several classes of metrized graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Tau Constant and the Edge Connectivity of a Metrized Graph

The tau constant is an important invariant of a metrized graph. It has connections to other graph invariants such as Kirchhoff index, and it has applications to arithmetic properties of algebraic curves. We show how the tau constant of a metrized graph changes under successive edge contractions and deletions. We prove identities which we call “contraction”, “deletion”, and “contraction-deletion...

متن کامل

The tau constant and the discrete Laplacian matrix of a metrized graph

Metrized graphs are finite graphs equipped with a distance function on their edges. For a metrized graph Γ, the tau constant τ(Γ) is an invariant which plays important roles in both harmonic analysis on metrized graphs and arithmetic of curves. T. Chinburg and R. Rumely [CR] introduced a canonical measure μcan of total mass 1 on a metrized graph Γ. The diagonal values of the Arakelov-Green’s fu...

متن کامل

Characteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs

Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...

متن کامل

Tenacity and some related results

Conceptually graph vulnerability relates to the study of graphintactness when some of its elements are removed. The motivation forstudying vulnerability measures is derived from design and analysisof networks under hostile environment. Graph tenacity has been anactive area of research since the the concept was introduced in1992. The tenacity T(G) of a graph G is defined asbegin{center} $T(G)=di...

متن کامل

Balanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations

A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2011